Occupation Statistics of Critical Branching Random Walks in Two or Higher Dimensions

نویسندگان

  • STEVEN P. LALLEY
  • XINGHUA ZHENG
چکیده

Consider a critical nearest neighbor branching random walk on the d-dimensional integer lattice initiated by a single particle at the origin. Let Gn be the event that the branching random walk survives to generation n. We obtain limit theorems conditional on the event Gn for a variety of occupation statistics: (1) Let Vn be the maximal number of particles at a single site at time n. If the offspring distribution has finite αth moment for some integer α ≥ 2, then in dimensions 3 and higher, Vn = Op(n); and if the offspring distribution has an exponentially decaying tail, then Vn = Op(log n) in dimensions 3 and higher, and Vn = Op((log n)) in dimension 2. Furthermore, if the offspring distribution is non-degenerate then P (Vn ≥ δ log n|Gn) → 1 for some δ > 0. (2) Let Mn(j) be the number of multiplicityj sites in the nth generation, that is, sites occupied by exactly j particles. In dimensions 3 and higher, the random variables Mn(j)/n converge jointly to multiples of an exponential random variable. (3) In dimension 2, the number of particles at a “typical” site (that is, at the location of a randomly chosen particle of the nth generation) is of order Op(log n), and the number of occupied sites is Op(n/ log n).

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Occupation Statistics of Critical Branching Random Walks

We consider a critical nearest neighbor branching random walk on the d−dimensional integer lattice. Denote by Vm the maximal number of particles at a single site at time m, and by Gm the event that the branching random walk survives to generation m. We show that if the offspring distribution has finite n-th moment, then in dimensions d ≥ 3, conditional on Gm, Vm = Op(m 1 n ); and if the offspri...

متن کامل

A functional CLT for the occupation time of state-dependent branching random walk

We show that the centred occupation time process of the origin of a system of critical binary branching random walks in dimension d ≥ 3, started off either from a Poisson field or in equilibrium, when suitably normalised, converges to a Brownian motion in d ≥ 4. In d = 3, the limit process is fractional Brownian motion with Hurst parameter 3/4 when starting in equilibrium, and a related Gaussia...

متن کامل

Intersection-Equivalence of Brownian Paths and Certain Branching Processes

We show that sample paths of Brownian motion (and other stable processes) intersect the same sets as certain random Cantor sets constructed by a branching process. With this approach, the classical result that two independent Brownian paths in four dimensions do not intersect reduces to the dying out of a critical branching process, and estimates due to Lawler (1982) for the long-range intersec...

متن کامل

Approximating Critical Parameters of Branching Random Walks

Given a branching random walk on a graph, we consider two kinds of truncations: by inhibiting the reproduction outside a subset of vertices and by allowing at most m particles per site. We investigate the convergence of weak and strong critical parameters of these truncated branching random walks to the analogous parameters of the original branching random walk. As a corollary, we apply our res...

متن کامل

ar X iv : 0 90 1 . 02 46 v 1 [ m at h . PR ] 2 J an 2 00 9 SPATIAL EPIDEMICS AND LOCAL TIMES FOR CRITICAL BRANCHING RANDOM WALKS IN DIMENSIONS

ABSTRACT. The behavior at criticality of spatial SIR (susceptible/infected/recovered) epidemic models in dimensions two and three is investigated. In these models, finite populations of size N are situated at the vertices of the integer lattice, and infectious contacts are limited to individuals at the same or at neighboring sites. Susceptible individuals, once infected, remain contagious for o...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007